Uniform Multipaging Reduces to Paging
نویسنده
چکیده
Multipaging is the paging problem when more than one page can be requested at each step [3]. In the uniform cost model, a paging algorithm is charged for the number of pages loaded from disk to fast memory. In this note, we establish a general reduction from uniform multipaging to paging. As a consequence, we obtain the rst strongly competitive randomized algorithm for uniform multipaging.
منابع مشابه
Reducing the paging costs under delay bounds for PCS networks
In this paper new paging schemes are presented for locating mobile users in wireless networks. Paging costs and delay bounds are considered since the paging cost is associated with bandwidth utilization and delay bounds influence call setup time. In general, location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. To reduce the paging cost...
متن کاملAn optimal partition algorithm for minimization of paging costs
A novel paging scheme under delay bounds is proposed for personal communication systems. This paging scheme is independent of the location probability distributions of the mobile users and satisfies the delay bounds, while minimizing the amount of bandwidth used for locating a mobile user. The proposed paging scheme includes the optimal partition algorithm and paging procedure with respect to p...
متن کاملReducing the Paging Costs under Delay Bound for PCS Networks
In this paper new paging schemes are introduced to reduce paging costs under delay bounds. In general , location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. Three new paging schemes, reverse, semi-reverse and uniform, provide a simple way of partitioning the service areas and accordingly minimize the paging costs based on each mobile t...
متن کاملEeective Paging Schemes with Delay Bounds as Qos Constraints in Wireless Systems
as QoS Constraints in Wireless Systems Wenye Wang, Ian F. Akyildiz, and Gordon L. St uber School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, GA 30332 Email: fwenye, ian, [email protected] Tel: (404)-894-5141; Fax: (404) 894-7883 Abstract In this paper, new paging schemes are introduced to reduce paging costs under delay bounds. In general, location track...
متن کاملEffective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems
In this paper new paging schemes are presented for locating mobile users in wireless networks. Paging costs and delay bounds are considered since paging costs are associated with bandwidth utilization and delay bounds influence call setup time. In general, location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. To reduce the paging costs,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 67 شماره
صفحات -
تاریخ انتشار 1998